Notes on locally internal uninorm on bounded lattices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notes on “Some Properties of L-fuzzy Approximation Spaces on Bounded Integral Residuated Lattices”

In this note, we continue the works in the paper [Some properties of L-fuzzy approximation spaces on bounded integral residuated lattices", Information Sciences, 278, 110-126, 2014]. For a complete involutive residuated lattice, we show that the L-fuzzy topologies generated by a reflexive and transitive L-relation satisfy (TC)L or (TC)R axioms and the L-relations induced by two L-fuzzy topologi...

متن کامل

On Equations in Bounded Lattices

The following properties of Boolean equations are well known: every system of equations is equivalent to a single equation of the form f(x1, . . . , xn) = 1, the consistency condition for such an equation, the method of successive elimination of variables, and the formula for the general (reproductive) solution using a particular solution. These features are shared by Post equations and by equa...

متن کامل

Notes on Polynomially Bounded Arithmetic

We characterize the collapse of Buss' bounded arithmetic in terms of the provable collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.

متن کامل

Notes on Space - Bounded Complexity

A machine solves a problem using space s(·) if, for every input x, the machine outputs the correct answer and uses only the first s(|x|) cells of the tape. For a standard Turing machine, we can’t do better than linear space since x itself must be on the tape. So we will often consider a machine with multiple tapes: a read-only “input” tape, a read/write “work” or “memory” tape, and possibly a w...

متن کامل

On Bounded Distance Decoding for General Lattices

A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice L represented by some basis, and a target point y, nd the lattice point closest to y. Bounded Distance Decoding is a variant of this problem in which the target is guaranteed to be close to the lattice, relative to the minimum distance 1(L) of the lattice. Speci cally, in the -Bounded Distance ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kybernetika

سال: 2017

ISSN: 0023-5954,1805-949X

DOI: 10.14736/kyb-2017-5-0911